Ramified Recurrence and Computational Complexity IV : Predicative Functionals and Poly-Space
Identifieur interne : 009A18 ( Main/Exploration ); précédent : 009A17; suivant : 009A19Ramified Recurrence and Computational Complexity IV : Predicative Functionals and Poly-Space
Auteurs : Daniel Leivant ; Jean-Yves MarionSource :
- Information and Computation ; 2000.
English descriptors
Abstract
We formulate a notion of predicative function types, and define predicative recurrence over functions, both in equational style and as an applicative formalism, pointing out the equivalence between the two approaches. We then show that a function is polyspace iff it is defined using predicative functionals obtained by ramified recurrence over words.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 002892
- to stream Crin, to step Curation: 002892
- to stream Crin, to step Checkpoint: 001964
- to stream Main, to step Merge: 009F98
- to stream Main, to step Curation: 009A18
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="493">Ramified Recurrence and Computational Complexity IV : Predicative Functionals and Poly-Space</title></titleStmt><publicationStmt><idno type="RBID">CRIN:leivant00b</idno><date when="2000" year="2000">2000</date><idno type="wicri:Area/Crin/Corpus">002892</idno><idno type="wicri:Area/Crin/Curation">002892</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002892</idno><idno type="wicri:Area/Crin/Checkpoint">001964</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001964</idno><idno type="wicri:Area/Main/Merge">009F98</idno><idno type="wicri:Area/Main/Curation">009A18</idno><idno type="wicri:Area/Main/Exploration">009A18</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Ramified Recurrence and Computational Complexity IV : Predicative Functionals and Poly-Space</title><author><name sortKey="Leivant, Daniel" sort="Leivant, Daniel" uniqKey="Leivant D" first="Daniel" last="Leivant">Daniel Leivant</name></author><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name></author></analytic><series><title level="j">Information and Computation</title><imprint><date when="2000" type="published">2000</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computational complexity</term><term>Predicative recurrence</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1525">We formulate a notion of predicative function types, and define predicative recurrence over functions, both in equational style and as an applicative formalism, pointing out the equivalence between the two approaches. We then show that a function is polyspace iff it is defined using predicative functionals obtained by ramified recurrence over words.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Leivant, Daniel" sort="Leivant, Daniel" uniqKey="Leivant D" first="Daniel" last="Leivant">Daniel Leivant</name><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 009A18 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 009A18 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:leivant00b
|texte= Ramified Recurrence and Computational Complexity IV : Predicative Functionals and Poly-Space
}}
| This area was generated with Dilib version V0.6.33. |  |